Termination w.r.t. Q of the given QTRS could be disproven:

(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

b(a(a(x1))) → a(x1)
a(a(a(x1))) → b(b(b(x1)))
b(b(x1)) → a(b(a(x1)))

Q is empty.

(1) NonTerminationProof (EQUIVALENT transformation)

We used the non-termination processor [OPPELT08] to show that the SRS problem is infinite.

Found the self-embedding DerivationStructure:

b b a a → b b a a

b b a a → b b a a
by OverlapClosure OC 2

b b a a → b b a b a a
by OverlapClosure OC 3

b b a a → b b b b a
by OverlapClosure OC 3

b b a a → a a a b a
by OverlapClosure OC 3

b b a a → a b b a b a
by OverlapClosure OC 2

b b → a b a
by original rule (OC 1)

a a a → b a b a
by OverlapClosure OC 2

a a a → b b b
by original rule (OC 1)

b b → a b a
by original rule (OC 1)

b b a → a a
by OverlapClosure OC 2

b b → a b a
by original rule (OC 1)

b a a → a
by original rule (OC 1)

a a a → b b b
by original rule (OC 1)

b b → a b a
by original rule (OC 1)

b a a → a
by original rule (OC 1)

(2) NO